Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Primal-dual algorithms")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

A GROUP-STRATEGYPROOF COST SHARING MECHANISM FOR THE STEINER FOREST GAMEKÖNEMANN, Jochen; LEONARDI, Stefano; SCHÄFER, Guido et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1319-1341, issn 0097-5397, 23 p.Article

Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methodsNEMIROVSKI, Arkadi; TUNNEL, Levent.Mathematical programming. 2005, Vol 102, Num 2, pp 261-294, issn 0025-5610, 34 p.Article

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problemsACHACHE, Mohamed.Applied mathematics and computation. 2010, Vol 216, Num 7, pp 1889-1895, issn 0096-3003, 7 p.Article

Primal-dual algorithms for Connected Facility Location problemsSWAMY, Chaitanya; KUMAR, Amit.Algorithmica. 2004, Vol 40, Num 4, pp 245-269, issn 0178-4617, 25 p.Article

A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility FunctionsHUANG, Li-Sha.Algorithmica. 2008, Vol 51, Num 3, pp 357-366, issn 0178-4617, 10 p.Conference Paper

Market Equilibrium via a Primal-Dual Algorithm for a Convex ProgramDEVANUR, Nikhil R; PAPADIMITRIOU, Christos H; SABERI, Amin et al.Journal of the Association for Computing Machinery. 2008, Vol 55, Num 5, issn 0004-5411, 22-22.18Article

An almost-linear time and linear space algorithm for the longest common subsequence problemGUO, J. Y; HWANG, F. K.Information processing letters. 2005, Vol 94, Num 3, pp 131-135, issn 0020-0190, 5 p.Article

The transportation problem revisited— preprocessing before using the primal―dual algorithmHADDADI, S; SLIMANI, O.The Journal of the Operational Research Society. 2012, Vol 63, Num 7, pp 1006-1009, issn 0160-5682, 4 p.Article

An Efficient Scaling Algorithm for the Minimum Weight Bibranching ProblemBABENKO, Maxim A.Algorithmica. 2011, Vol 61, Num 4, pp 898-922, issn 0178-4617, 25 p.Conference Paper

Combinatorial Algorithms for Data Migration to Minimize Average Completion TimeGANDHI, Rajiv; MESTRE, Julian.Algorithmica. 2009, Vol 54, Num 1, pp 54-71, issn 0178-4617, 18 p.Article

The clustering matroid and the optimal clustering treeKORACH, Ephraim; STERN, Michal.Mathematical programming. 2003, Vol 98, Num 1-3, pp 385-414, issn 0025-5610, 30 p.Conference Paper

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability propertyGARG, Dinesh; JAIN, Kamal; TALWAR, Kunal et al.Theoretical computer science. 2007, Vol 378, Num 2, pp 143-152, issn 0304-3975, 10 p.Conference Paper

The Impact of Stochastic Noisy Feedback on Distributed Network Utility MaximizationJUNSHAN ZHANG; DONG ZHENG; MUNG CHIANG et al.IEEE transactions on information theory. 2008, Vol 54, Num 2, pp 645-665, issn 0018-9448, 21 p.Article

Online Allocation of Communication and Computation Resources for Real-Time Multimedia ServicesJUN LIAO; CHOU, Philip A; CHUN YUAN et al.IEEE transactions on multimedia. 2013, Vol 15, Num 3, pp 670-683, issn 1520-9210, 14 p.Article

Computation of limit and shakedown loads using a node-based smoothed finite element methodNGUYEN-XUAN, H; RABCZUK, T; NGUYEN-THOI, T et al.International journal for numerical methods in engineering. 2012, Vol 90, Num 3, pp 287-310, issn 0029-5981, 24 p.Article

  • Page / 1